- inductive definition of sets
- n.集合的归纳定义
English-Chinese dictionary of mining (英汉矿业大词典). 2013.
inductive definition of sets
Look at other dictionaries:
Definition — For other uses, see Definition (disambiguation). A definition is a passage that explains the meaning of a term (a word, phrase or other set of symbols), or a type of thing. The term to be defined is the definiendum. A term may have many different … Wikipedia
Inductive dimension — In the mathematical field of topology, the inductive dimension of a topological space X is either of two values, the small inductive dimension ind(X) or the large inductive dimension Ind(X). These are based on the observation that, in n… … Wikipedia
Intuitionistic type theory — Intuitionistic type theory, or constructive type theory, or Martin Löf type theory or just Type Theory is a logical system and a set theory based on the principles of mathematical constructivism. Intuitionistic type theory was introduced by Per… … Wikipedia
Dimension — 0d redirects here. For 0D, see 0d (disambiguation). For other uses, see Dimension (disambiguation). From left to right, the square, the cube, and the tesseract. The square is bounded by 1 dimensional lines, the cube by 2 dimensional areas, and… … Wikipedia
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Analytical hierarchy — In mathematical logic and descriptive set theory, the analytical hierarchy is a higher type analogue of the arithmetical hierarchy. It thus continues the classification of sets by the formulas that define them. The analytical hierarchy of… … Wikipedia
Hyperarithmetical theory — In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an… … Wikipedia
Brouwer-Hilbert controversy — A foundational controversy in twentieth century history of mathematics opposed L. E. J. Brouwer, a supporter of intuitionism, and David Hilbert, the founder of formalism.BackgroundThe background for the controversy was set with David Hilbert s… … Wikipedia
Ordinal arithmetic — In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation. Each can be defined in essentially two different ways: either by constructing an… … Wikipedia
Problem of evil — Part of a series on God General conceptions … Wikipedia
